Laws of large numbers for the annealing algorithm

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laws of Large Numbers for Random Linear

The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...

متن کامل

ON THE LAWS OF LARGE NUMBERS FOR DEPENDENT RANDOM VARIABLES

In this paper, we extend and generalize some recent results on the strong laws of large numbers (SLLN) for pairwise independent random variables [3]. No assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). Also Chandra’s result on Cesàro uniformly integrable r.v.’s is extended.

متن کامل

on the laws of large numbers for dependent random variables

in this paper, we extend and generalize some recent results on the strong laws of large numbers (slln) for pairwise independent random variables [3]. no assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). also chandra’s result on cesàro uniformly integrable r.v.’s is extended.

متن کامل

The Laws of Large Numbers Compared

Probability Theory includes various theorems known as Laws of Large Numbers; for instance, see [Fel68, Hea71, Ros89]. Usually two major categories are distinguished: Weak Laws versus Strong Laws. Within these categories there are numerous subtle variants of differing generality. Also the Central Limit Theorems are often brought up in this context. Many introductory probability texts treat this ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1990

ISSN: 0304-4149

DOI: 10.1016/0304-4149(90)90009-h